A Fast Modular Reduction Method
نویسندگان
چکیده
We put forth a lookup-table-based modular reduction method which partitions the binary string of an integer to be reduced into blocks according to its runs. Its complexity depends on the amount of runs in the binary string. We show that the new reduction is almost twice as fast as the popular Barrett’s reduction, and provide a thorough complexity analysis of the method.
منابع مشابه
Fast Modular Reduction over Euclidean Rings and Its Application to Universal Hash Functions
In this letter, we propose a fast modular reduction method over Euclidean rings, which is a generalization of Barrett’s reduction algorithm over the ring of integers. As an application, we construct new universal hash function families whose operations are modular arithmetic over a Euclidean ring, which can be any of three rings, the ring of integers, the ring of Gauss integers and the ring of ...
متن کاملFast Modular Reduction With Precomputation
Multiplication and modular reduction of long integers are two primitive operations for the implementation of most public key crypto algorithms. Multiplication can be best performed using Karatsuba's divide-and-conquer technique. However, the modular reduction process is more complicated and time-consuming. Thus an eecient implementation of modular reduction operation is one of main factors aaec...
متن کاملModular Reduction in GF(2n) without Pre-computational Phase
In this study we show how modular multiplication with Barrett and Montgomery reductions over certain finite fields of characteristic 2 can be implemented efficiently without using a pre-computational phase. We extend the set of moduli that is recommended by Standards for Efficient Cryptography (SEC) by defining two distinct sets for which either Barrett or Montgomery reduction is applicable. As...
متن کاملInvestigation the status of instructional design with modular method in medical education
Background and Goal: Modular method is a form of in-service training which provides job skills into a form of independent training of audiences. Each of modular provides specific skill and at the same time besides the other modular led to a new and comprehensive skill. In fact, any educational modular is a set of knowledge, attitudes and skills which by using them it can be possible to do ...
متن کاملComparison of Three Modular Reduction Functions
Three modular reduction algorithms for large integers are compared with respect to their performance in portable software: the classical algorithm, Barrett’s algorithm and Montgomery’s algorithm. These algorithms are a time critical step in the implementation of the modular exponentiation operation. For each of these algorithms their application in the modular exponentiation operation is consid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2014 شماره
صفحات -
تاریخ انتشار 2014